منابع مشابه
Hypergraph Rewriting
In their pioneering paper [KB70], Knuth and Bendix showed that con uence (or, equivalently, the Church-Rosser property) is decidable for terminating term rewriting systems. It su ces to compute all critical pairs t s ! u of rewrite steps in which s is the superposition of the left-hand sides of two rules, and to check whether t and u reduce to a common term. This procedure is justi ed by the so...
متن کاملHypergraph rewriting using conformisms
In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, is presented. In particular , we show the existence of the pushout of any pair of conformisms of hypergraphs...
متن کاملImplementing -reduction by Hypergraph Rewriting
The aim of this paper is to implement the-reduction in the-calculus with a hypergraph rewriting mechanism called collapsed-tree rewriting. It turns out that collapsed-tree rewriting is sound with respect to-reduction and complete with respect to the Gross-Knuth strategy. As a consequence, there exists a normal form for a collapsed-tree if and only if there exists a normal form for the represent...
متن کاملParsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like anbncn can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constitu...
متن کاملAttributed Context-Free Hypergraph Grammars
The concept of context-free hypergraph grammars (cfhg grammars) has been studied extensively over the past decade. In this paper we introduce attributed context-free hypergraph grammars (acfhg grammars) as an extension of cfhg grammars. An acfhg grammar consists of an underlying context-free hypergraph grammar G 0 and an attribution which associates attributes with the nonterminal symbols of G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1993
ISSN: 0022-0000
DOI: 10.1016/0022-0000(93)90004-g